Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
نویسندگان
چکیده
Article history: Received 3 February 2012 Received in revised form 16 April 2012 Accepted 23 April 2012 Available online 15 May 2012 Communicated by D. Pointcheval
منابع مشابه
On $k$-error linear complexity of pseudorandom binary sequences derived from Euler quotients
We investigate the k-error linear complexity of pseudorandom binary sequences of period pr derived from the Euler quotients modulo pr−1, a power of an odd prime p for r ≥ 2. When r = 2, this is just the case of polynomial quotients (including Fermat quotients) modulo p, which has been studied in an earlier work of Chen, Niu and Wu. In this work, we establish a recursive relation on the k-error ...
متن کاملOn the linear complexity of binary threshold sequences derived from Fermat quotients
We determine the linear complexity of a family of p2-periodic binary threshold sequences derived fromFermat quotientsmodulo an odd prime p, where p satisfies 2p−1 ≡ 1 (mod p2). The linear complexity equals p2 − p or p2 − 1, depending whether p ≡ 1 or 3 (mod 4). Our research extends the results from previous work on the linear complexity of the corresponding binary threshold sequences when 2 is ...
متن کاملLinear complexity of binary sequences derived from polynomial quotients
We determine the linear complexity of p-periodic binary threshold sequences derived from polynomial quotient, which is defined by the function (u−u)/p (mod p). When w = (p−1)/2 and 2p−1 6≡ 1 (mod p), we show that the linear complexity is equal to one of the following values { p − 1, p − p, (p + p)/2 + 1, (p − p)/2 } , depending whether p ≡ 1, −1, 3, −3 (mod 8). But it seems that the method can’...
متن کاملOn the binary sequences with high GF(2) linear complexities and low GF(p) linear complexities
Klapper [1] showed that there are binary sequences of period q − 1(q is a prime power p, p is an odd prime) with the maximal possible linear complexity q−1 when considered as sequences over GF (2), while the sequences have very low linear complexities when considered as sequences over GF (p). This suggests that the binary sequences with high GF (2) linear complexities and low GF (p) linear comp...
متن کاملThe ray attack, an inefficient trial to break RSA cryptosystems
The basic properties of RSA cryptosystems and some classical attacks on them are described. Derived from geometric properties of the Euler functions, the Euler function rays, a new ansatz to attack RSA cryptosystems is presented. A resulting, albeit inefficient, algorithm is given. It essentially consists of a loop with starting value determined by the Euler function ray and with step width giv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 112 شماره
صفحات -
تاریخ انتشار 2012